CAST - A Task-Level Concurrency Analysis Tool
نویسندگان
چکیده
CAST is a system-level software tool that supports the design of concurrent systems. It assumes that the functional model of a system is specified as a set of compute nodes that communicate with each other using point-to-point connections. CAST provides concurrency analysis, support for refinement of the concurrency in the model to implement, and guidance in the design-space exploration. Its main focus is on streaming applications. This paper provides a brief tutorial on CAST. It describes the implementation of the techniques used to model and analyze the concurrency in a specification. Visualization of the metrics is key for performing a guided design-space exploration, which is why visualization is an integral part of CAST. This paper presents therefore also our solutions for visualizing concurrency in a specification.
منابع مشابه
Analyzing concurrency in streaming applications
We present a concurrency model that allows reasoning about concurrency in executable specifications of streaming applications. It provides measures for five different concurrency properties. The aim of the model is to provide insight into concurrency bottlenecks in an application and to provide global direction when performing implementationindependent concurrency optimization. The model focuse...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملAnalysis of May-Happen-in-Parallel in Concurrent Objects
This paper presents a may-happen-in-parallel (MHP) analysis for OO languages based on concurrent objects. In this concurrency model, objects are the concurrency units such that, when a method is invoked on an object o2 from a task executing on object o1, statements of the current task in o1 may run in parallel with those of the (asynchronous) call on o2, and with those of transitively invoked m...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA fast recursive mapping algorithm
This paper presents a generic technique for mapping parallel algorithms onto parallel architectures. The proposed technique is a fast recursive mapping algorithmwhich is a component of the Cluster-M programming tool. The other components of Cluster-M are the Speciication module and the Representation module. In the Speciication module, for a given task speciied by a high-level machine-independe...
متن کامل